Mixing Time for Square Tilings

We consider tilings of Z by two types of squares. We are interested in the rate of convergence to the stationarity of a natural Markov chain defined for square tilings. The rate of convergence can be represented by the mixing time which measures the amount of time it takes the chain to be close to its stationary distribution. We prove polynomial mixing time for n× logn regions in the case of tilings by 1× 1 and s× s squares. We also consider a weighted Markov chain with weights λ being put on big squares. We show rapid mixing of O(n logn) with conditions on λ. We provide simulations that suggest different conjectures, one of which is the existence of frozen regions in random tilings by squares.